639A - Bear and Displayed Friends - CodeForces Solution

n, k, q = map(int, input().split())
t = list(map(int, input().split()))

s = set()
l = [0] * k

c, m = 0, 0

for i in range(q):
	x, y = map(int, input().split())
	
	if x == 1:
		c += 1
		s.add(y)
		
		l[0] = max(t[y - 1], l[0])
		l.sort()
	else:
		if y not in s:
			print("NO")
		
		elif c < k:
			print("YES")
		
		elif t[y - 1] >= l[0]:
			print("YES")
		else:
			print("NO")